Collapsible Pushdown Automata and Recursion Schemes
نویسندگان
چکیده
منابع مشابه
Recursion Schemes, Collapsible Pushdown Automata and Higher-Order Model Checking
This paper is about two models of computation that underpin recent developments in the algorithmic verification of higher-order computation. Recursion schemes are in essence the simply-typed lambda calculus with recursion, generated from first-order symbols. Collapsible pushdown automata are a generalisation of pushdown automata to higher-order stacks — which are iterations of stack of stacks —...
متن کاملRecursive Schemes, Krivine Machines, and Collapsible Pushdown Automata
Higher-order recursive schemes offer an interesting method of approximating program semantics. The semantics of a scheme is an infinite tree labeled with built-in constants. This tree represents the meaning of the program up to the meaning of built-in constants. It is much easier to reason about properties of such trees than properties of interpreted programs. Moreover some interesting properti...
متن کاملVariants of Collapsible Pushdown Systems
We analyze the relationship between three ways of generating trees using collapsible pushdown systems (CPS’s): using deterministic CPS’s, nondeterministic CPS’s, and deterministic wordaccepting CPS’s. We prove that (for each level of the CPS and each input alphabet) the three classes of trees are equal. The nontrivial translations increase n− 1 times exponentially the size of the level-n CPS. T...
متن کاملUnified Analysis of Collapsible and Ordered Pushdown Automata via Term Rewriting
We model collapsible and ordered pushdown systems with term rewriting, by encoding higher-order stacks and multiple stacks into trees. We show a uniform inverse preservation of recognizability result for the resulting class of term rewriting systems, which is obtained by extending the classic saturation-based approach. This result subsumes and unifies similar analyses on collapsible and ordered...
متن کاملA Saturation Method for Collapsible Pushdown Systems
We introduce a natural extension of collapsible pushdown systems called annotated pushdown systems that replaces collapse links with stack annotations. We believe this new model has many advantages. We present a saturation method for global backwards reachability analysis of these models that can also be used to analyse collapsible pushdown systems. Beginning with an automaton representing a se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2017
ISSN: 1529-3785,1557-945X
DOI: 10.1145/3091122